Server-aided Public Key Signatures for Diverse Network Devices
نویسندگان
چکیده
منابع مشابه
Experimenting with Server-Aided Signatures
This paper explores practical and conceptual implications of using Server-Aided Signatures (SAS). SAS is a signature method that relies on partially-trusted servers for generating public key signatures for regular users. Besides its two primary goals of 1) aiding small, resource-limited devices in computing heavyweight (normally expensive) digital signatures and 2) fast certificate revocation, ...
متن کاملPassword Based Server Aided Key Exchange
We propose a new password-based 3-party protocol with a formal security proof in the standard model. Under reasonable assumptions we show that our new protocol is more efficient than the recent protocol of Abdalla and Pointcheval (FC 2005), proven in the random oracle model. We also observe some limitations in the model due to Abdalla, Fouque and Pointcheval (PKC 2005) for proving security of s...
متن کاملServer (Prover/Signer)-Aided Verification of Identity Proofs and Signatures
Discrete log based identiication and signature schemes are well-suited to identity proof and signature generation, but not suitable for veriication, by smart cards, due to their highly asymmetric computational load between the prover/signer and the veriier. In this paper, we present very eecient and practical protocols for fast veriication in these schemes, where the veriier with limited comput...
متن کاملFast Server-Aided RSA Signatures Secure Against Active Attacks
Small units like chip cards have the possibility of computing, storing and protecting data. Today such chip cards have limited computing power, then some cryptoprotocols are too slow. Some new chip cards with secure fast coprocessors are coming but are not very reliable at the moment and a little bit expensive for some applications. In banking a p plications there are few servers (ATM) relative...
متن کاملTightly Secure Signatures and Public-Key Encryption
We construct the first public-key encryption scheme whose chosen-ciphertext (i.e., IND-CCA) security can be proved under a standard assumption and does not degrade in either the number of users or the number of ciphertexts. In particular, our scheme can be safely deployed in settings in which no a-priori bound on the number of encryptions and/or users is known. As a central technical building b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Technology and Management Research
سال: 2020
ISSN: 2026-6480,2026-6480
DOI: 10.47127/ijtmr.v1i1.6